A d-Sequence based Recursive Random Number Generator
نویسنده
چکیده
This paper presents a novel approach to generating binary random numbers using d-sequences. We perform various correlation analyses on the new random number generator and provide a new tool to researchers using which the correlation properties of the random sequences can be controlled as desired.
منابع مشابه
Period of the d-Sequence Based Random Number Generator
This paper presents an expression to compute the exact period of a recursive random number generator based on d-sequences. Using the multi-recursive version of this generator we can produce large number of pseudorandom sequences.
متن کاملBinary Random Sequences Obtained From Decimal Sequences
D sequences [1-15] are perhaps the simplest family of random sequences that subsumes other families such as shift register sequences [16]. In their ordinary form, d sequences are not computationally complex [2], but they can be used in a recursive form [8] that is much stronger from a complexity point of view. The basic method of the generating the binary d-sequences is given in [1]. The autoco...
متن کاملLimit distribution of the degrees in scaled attachment random recursive trees
We study the limiting distribution of the degree of a given node in a scaled attachment random recursive tree, a generalized random recursive tree, which is introduced by Devroye et. al (2011). In a scaled attachment random recursive tree, every node $i$ is attached to the node labeled $lfloor iX_i floor$ where $X_0$, $ldots$ , $X_n$ is a sequence of i.i.d. random variables, with support in [0,...
متن کاملRecursive Random Number Generator Using Prime Reciprocals
illustration, the prime reciprocal of 1/7 is , and the prime reciprocal sequence is considered to be 142857. The period of this sequence is 6. Since the maximum length of the period can be (p-1), this is an example of a maximum-length d-sequence. But a prime reciprocal sequence that is maximum length in one base need not be maximum length in another base. Thus the binary prime reciprocal sequen...
متن کاملDesign of Cryptographically Strong Generator By Transforming Linearly Generated Sequences
Random numbers have been used extensively in many simulation applications like Monte Carlo Integration or computer modeling. But recently security applications have increased the need for strong (secure) random number generation like automatic password generation, encryption algorithms, on-line gambling etc. Thus random number generation has become a challenging and an interesting task. Most cl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2006 شماره
صفحات -
تاریخ انتشار 2006